Improved Coverings of a Square with Six and Eight Equal Circles
نویسندگان
چکیده
منابع مشابه
Improved Coverings of a Square with Six and Eight Equal Circles
In a recent article 19], Tarnai and GG aspp ar used computer simulations to nd thin coverings of a square with up to ten equal circles. We will give improved coverings with six and eight circles and a new, thin covering with eleven circles, found by the use of simulated annealing. Furthermore, we present a combinatorial method for constructing lower bounds for the optimal covering radius.
متن کاملA better packing of ten equal circles in a square
Let S be a square of side s in the Euclidean plane. A pucking of circles in S is nothing else but a finite family of circular disks included in S whose interiors are pairwise disjoints. A natural problem related with such packings is the description of the densest ones; in particular, what is the greatest value of the common radius r of n circles forming a packing of S? Clearly, the centres of ...
متن کاملMore Optimal Packings of Equal Circles in a Square
The problem of nding the maximum radius of n non-overlapping equal circles in a unit square is considered. A computer-aided method for proving global optimality of such packings is presented. This method is based on recent results by De Groot, Monagan, Peik-ert, and WWrtz. As an example, it is shown how the method can be used to get an optimality proof for the case n = 7, which has not earlier ...
متن کاملPacking up to 50 Equal Circles in a Square
The Hungarian mathematician Farkas Bolyai (1775–1856) published in his principal work (‘Tentamen’, 1832–33 [Bol04]) a dense regular packing of equal circles in an equilateral triangle (see Fig. 1). He defined an infinite packing series and investigated the limit of vacuitas (in Latin, the gap in the triangle outside the circles). It is interesting that these packings are not always optimal in s...
متن کاملPacking Equal Circles in a Square: I. Solution Properties
In this paper some properties of optimal solutions for the problem of packing n equal circles into the unit square will be derived. In particular, properties, which must be satissed by at least one optimal solution of the problem and stating the intuitive fact that as many circles as possible should touch the boundary of the unit square, will be introduced.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 1996
ISSN: 1077-8926
DOI: 10.37236/1256